Families of Graphs With Chromatic Zeros Lying on Circles
نویسندگان
چکیده
We define an infinite set of families of graphs, which we call p-wheels and denote (Wh) n , that generalize the wheel (p = 1) and biwheel (p = 2) graphs. The chromatic polynomial for (Wh) n is calculated, and remarkably simple properties of the chromatic zeros are found: (i) the real zeros occur at q = 0, 1, ...p+ 1 for n− p even and q = 0, 1, ...p+ 2 for n− p odd; and (ii) the complex zeros all lie, equally spaced, on the unit circle |q − (p + 1)| = 1 in the complex q plane. In the n → ∞ limit, the zeros on this circle merge to form a boundary curve separating two regions where the limiting function W ({(Wh)}, q) is analytic, viz., the exterior and interior of the above circle. Connections with statistical mechanics are noted. ∗email: [email protected] ∗∗email: [email protected]
منابع مشابه
Chromatic polynomials and their zeros and asymptotic limits for families of graphs
Let P (G, q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and defineW = limn→∞ P (G, q) 1/n. Besides their mathematical interest, these functions are important in statistical physics. We give a comparative discussion of exact calculations of P and W for a variety of recursive families of graphs, including strips of regular lattices with various boundary condition...
متن کاملChromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملAsymptotic Limits and Zeros of Chromatic Polynomials and Ground State Entropy of Potts Antiferromagnets
We study the asymptotic limiting function W ({G}, q) = limn→∞ P (G, q), where P (G, q) is the chromatic polynomial for a graph G with n vertices. We first discuss a subtlety in the definition of W ({G}, q) resulting from the fact that at certain special points qs, the following limits do not commute: limn→∞ limq→qs P (G, q) 1/n 6= limq→qs limn→∞ P (G, q). We then present exact calculations of W...
متن کاملGround State Entropy of the Potts Antiferromagnet on Cyclic Strip Graphs
We present exact calculations of the zero-temperature partition function (chromatic polynomial) and the (exponent of the) ground-state entropy S0 for the q-state Potts antiferromagnet on families of cyclic and twisted cyclic (Möbius) strip graphs composed of p-sided polygons. Our results suggest a general rule concerning the maximal region in the complex q plane to which one can analytically co...
متن کاملOn planar and non-planar graphs having no chromatic zeros in the interval (1, 2)
We exhibit a family of 2-connected graphs which is closed under certain operations, and show that each graph in the family has no chromatic zeros in the interval (1,2). The family contains not only collections of graphs having no certain minors, but also collections of plane graphs, including near-triangulations found by Birkhoff and Lewis [Chromatic polynomials, Trans. Amer. Math. Soc. 60 (194...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997